Staffing a Service System with Non-poisson Nonstationary Arrivals
نویسندگان
چکیده
Motivated by non-Poisson stochastic variability found in service system arrival data, we extend established service system staffing algorithms using the square-root staffing formula to allow for non-Poisson arrival processes. We develop a general model of the non-Poisson nonstationary arrival process that includes as a special case the nonstationary Cox process (a modification of a Poisson process in which the rate itself is a nonstationary stochastic process), which has been advocated in the literature. We characterize the impact of the non-Poisson stochastic variability upon the staffing through the heavy-traffic limit of the peakedness (ratio of the variance to the mean in an associated stationary infinite-server queueing model), which depends on the arrival process through its central limit theorem behavior. We provide simple formulas to quantify the performance impact of the non-Poisson arrivals upon the staffing decisions, in order to achieve the desired service level. We conduct simulation experiments with non-stationary Markov modulated Poisson arrival processes with sinusoidal arrival rate functions to demonstrate that the staffing algorithm is effective in stabilizing the time-varying probability of delay at designated targets.
منابع مشابه
Probability in the Engineering and Informational Sciences
Motivated by non-Poisson stochastic variability found in service system arrival data, we extend established service system staffing algorithms using the square-root staffing formula to allow for non-Poisson arrival processes. We develop a general model of the non-Poisson non-stationary arrival process that includes as a special case the non-stationary Cox process (a modification of a Poisson pr...
متن کاملAnalysis of unreliable bulk queue with statedependent arrivals
In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...
متن کاملStaffing to Stabilize Blocking in Loss Models with Non-markovian Arrivals
Previous work has shown that (i) it is not possible to find a time-varying staffing policy (number of servers) to stabilize blocking probabilities in a multi-server loss model with flexible staffing and a nonhomogeneous Poisson arrival process to the same extent as in a corresponding delay model, because the blocking probabilities necessarily change dramatically after each staffing change, but ...
متن کاملStaffing to Stabilize Blocking in Loss Models with Non-poisson Time-varying Arrivals
This paper proposes an approximation for the blocking probability in a many-server loss model with a non-Poisson time-varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time-varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing cha...
متن کاملMany-server Loss Models with Non-poisson Time-varying Arrivals
This paper proposes an approximation for the blocking probability in a many-server loss model with a non-Poisson time-varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time-varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing cha...
متن کامل